prod 3.2: An Advanced Tool for Efficient Reachability Analysis

prod is a reachability analyzer for Predicate/Transition Nets. The tool incorporates several advanced reduced reachability graph generation methods. The tool also includes a CTL model checker and supports on-they veriication of LTL formulas. prod is being used in industrial projects at the Digital Systems Laboratory. 1 Intro Reachability analysis is a powerful formal way to analyze concurrent and distributed systems such as telecommunication protocols. However reach-ability analysis suuers from the state-explosion problem: the state space of the system can be far too large with respect to the time and other resources needed to inspect all states in the space. Fortunately, errors can be detected in a variety of cases without inspecting all reachable states of the system. The stubborn set method 11],,10] is one of the methods that try to relieve the state space explosion. On the other hand in on-they veriication of a property the property is veri-ed during state space generation, in contrast to the traditional approach where properties are veriied after state space generation. The Pr/T-net reachability analysis tool prod 13], developed at thements among other methods the two above mentioned methods for ee-cient reachability analysis. The aim of this article is to give a brief overview of the basic features of the tool and shortly describe some of its applications. 2 The reachability analyzer prod prod is a command-line driven tool, ie. the user interacts with the tool from a Unix-shell. Currently no graphical user-interface exists. The tool consists of 5 components: